CVC : a Cooperating Validity
نویسندگان
چکیده
منابع مشابه
Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF
Software that can produce independently checkable evidence for the correctness of its output has received recent attention for use in certifying compilers and proofcarrying code. CVC (“a Cooperating Validity Checker) is a proof-producing validity checker for a decidable fragment of first-order logic enriched with background theories. This paper describes how proofs of valid formulas are produce...
متن کاملOnline Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic?
Efficient decision procedures for arithmetic play a very important role in formal verification. In practical examples, however, arithmetic constraints are often mixed with constraints from other theories like the theory of arrays, Boolean satisfiability (SAT), bit-vectors, etc. Therefore, decision procedures for arithmetic are especially useful in combination with other decision procedures. The...
متن کاملCooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
This paper is a case study in combining theorem provers. We define a derived rule in HOL-Light, CVC PROVE, which calls CVC Lite and translates the resulting proof object back to HOL-Light. This technique fundamentally expands the capabilities of HOL-Light while preserving soundness.
متن کاملAn Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic
Efficient decision procedures for arithmetic play a very important role in formal verification. In practical examples, however, arithmetic constraints are often mixed with constraints from other theories like the theory of arrays, Boolean satisfiability (SAT), bit-vectors, etc. Therefore, decision procedures for arithmetic are especially useful in combination with other decision procedures. The...
متن کاملChecking Satis ability of First-Order Formulas by Incremental Translation to SAT
In the past few years, general-purpose propositional satis-ability (SAT) solvers have improved dramatically in performance and have been used to tackle many new problems. It has also been shown that certain simple fragments of rst-order logic can be decided eeciently by rst translating the problem into an equivalent SAT problem and then using a fast SAT solver. In this paper, we describe an alt...
متن کامل